The Weber problem with regional demand
نویسندگان
چکیده
منابع مشابه
The maximin line problem with regional demand
Given a familyP 1⁄4 fP 1; . . . ; Pmg of m polygonal regions (possibly intersecting) in the plane, we consider the problem of locating a straight line ‘ intersecting the convex hull of P and such that minkd(Pk,‘) is maximal. We give an algorithm that solves the problem in time O((m + n logm) logn) using O(m + n) space, where n is the total number of vertices of P1, . . . ,Pm. The previous best ...
متن کاملThe inverse Fermat-Weber problem
Given n points in the plane with nonnegative weights, the inverse Fermat-Weber problem consists in changing the weights at minimum cost such that a prespecified point in the plane becomes the Euclidean 1-median. The cost is proportional to the increase or decrease of the corresponding weight. In case that the prespecified point does not coincide with one of the given n points, the inverse Ferma...
متن کاملWeber-Fechner’s Law and Demand Function
We apply the Weber-Fechner’s law, which represents the relation between the magnitude of physical stimulus and the magnitude of psychological sense in human being, to the utility function. We conclude that the utility function of n-types of goods is of separable type u(x1, x2, · · · , xn) = u1(x1) + u2(x2) + · · · + un(xn), which give the relation of the demand function in the form pi = dui/dxi...
متن کاملThe three-dimensional Fermat-Weber problem with Tchebychev distances
The three-dimensional Fermat-Weber facility location problem with Tchebychev distances is investigated. Expanding on previous research for the analogous two-dimensional problem, this study presents a new algorithm for solving the elusive three-dimensional case. The algorithm presented herein finds near optimal solutions in practical computational times. Some experimental results are also convey...
متن کاملOn the Continuous Fermat-Weber Problem
We give the first exact algorithmic study of facility location problems that deal with finding a median for a continuum of demand points. In particular, we consider versions of the “continuous k-median (Fermat-Weber) problem” where the goal is to select one or more center points that minimize the average distance to a set of points in a demand region. In such problems, the average is computed a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 1998
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(97)00190-2